Open Packing of Spheres

On Open Packing Number of Graphs

In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.

Covering and Packing with Spheres

We address the problem of covering R with congruent balls, while minimizing the number of balls that contain an average point. Considering the 1-parameter family of lattices defined by stretching or compressing the integer grid in diagonal direction, we give a closed formula for the covering density that depends on the distortion parameter. We observe that our family contains the thinnest latti...

on open packing number of graphs

in a graph g = (v,e), a subset s  v is said to be an open packing set if no two vertices of s have a common neighbour in g. the maximum cardinality of an open packing set is called the open packing number and is denoted by rho^o. this paper further studies on this parameter by obtaining some new bounds.

Packing and Assembling Spheres in Cylindrical Confinement

Voronoi tessellation of the packing of fine uniform spheres.

The packing of uniform fine spherical particles ranging from 1 to 1000 microm has been simulated by means of discrete particle simulation. The packing structure is analyzed, facilitated by the well established Voronoi tessellation. The topological and metric properties of Voronoi polyhedra are quantified as a function of particle size and packing density. The results show that as particle size ...